An Accelerated Greedy Missing Point Estimation Procedure
نویسندگان
چکیده
منابع مشابه
An Accelerated Greedy Missing Point Estimation Procedure
Model reduction via Galerkin projection fails to provide considerable computational savings if applied to general nonlinear systems. This is because the reduced representation of the state vector appears as an argument to the nonlinear function, whose evaluation remains as costly as for the full model. Masked projection approaches, such as the missing point estimation and the (discrete) empiric...
متن کاملAccelerated Greedy Mixture Learning
Mixture probability densities are popular models that are used in several data mining and machine learning applications, e.g., clustering. A standard algorithm for learning such models from data is the Expectation-Maximization (EM) algorithm. However, EM can be slow with large datasets, and therefore approximation techniques are needed. In this paper we propose a variational approximation to th...
متن کاملDetermination of Asphalt Binder VECD Parameters Using an Accelerated Testing Procedure
Fatigue characteristics of asphalt binder have an important role in asphalt mix resistance against cracking. Viscoelastic Continuum Damage (VECD) analysis of asphalt binders has been successfully used in highway research works in order to predict fatigue behavior of hot mix asphalt (HMA). In this method an intrinsic property of the material, called damage function is obtained which is independe...
متن کامل3D Point Representation For Pose Estimation: Accelerated SIFT vs ORB
Many novel local image descriptors (Random Ferns, ORB etc) are being proposed each year with claims of being as good as or superior to SIFT for representing point features. In this context we design a simple experimental framework to compare the performances of different descriptors for realtime recognition of 3D points in a given environment. We use this framework to show that robust descripto...
متن کاملGPU accelerated greedy algorithms for compressed sensing
For appropriate matrix ensembles, greedy algorithms have proven to be an efficient means of solving the combinatorial optimization problem associated with compressed sensing. This paper describes an implementation for graphics processing units (GPU) of hard thresholding, iterative hard thresholding, normalized iterative hard thresholding, hard thresholding pursuit, and a two-stage thresholding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2016
ISSN: 1064-8275,1095-7197
DOI: 10.1137/15m1042899